Optimal System Design of In-Situ Bioremediation Using Parallel Recombinative Simulated Annealing

نویسندگان

  • Horng-Jer Shieh
  • R. C. Peralta
چکیده

We present a simulation/optimization model combining optimization with BIOPLUME II simulation for optimizing in-situ bioremediation system design. In-situ bioremediation of contaminated groundwater has become widely accepted because of its cost-effective ability to achieve satisfactory cleanup. We use parallel recombinative simulated annealing to search for an optimal design and apply the BIOPLUME II model to simulate aquifer hydraulics and bioremediation. Parallel recombinative simulated annealing is a general-purpose optimization approach that has the good convergence of simulated annealing and the efficient parallelization of a genetic algorithm. This is the first time that parallel recombinative simulated annealing has been applied to groundwater management. The design goal of the in-situ bioremediation system is to minimize system installation and operation cost. System design decision variables are pumping well locations and pumping rates. The problem formulation is mixed-integer and nonlinear. The system design must satisfy constraints on pumping rates, hydraulic heads, contaminant concentration at the plume source and at downstream monitoring wells. For the posed problem, the parallel recombinative simulated annealing obtains an optimal solution that minimizes system cost, reduces contaminant concentration and prevents plume migration.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Recombinative Simulated Annealing: a Genetic Algorithm Parallel Recombinative Simulated Annealing: a Genetic Algorithm

This paper introduces and analyzes a parallel method of simulated annealing. Borrowing from genetic algorithms, an eeective combination of simulated annealing and genetic algorithms, called parallel recombinative simulated annealing, is developed. This new algorithm strives to retain the desirable asymptotic convergence properties of simulated annealing, while adding the populations approach an...

متن کامل

Comparing Parallel Simulated Annealing, Parallel Vibrating Damp Optimization and Genetic Algorithm for Joint Redundancy-Availability Problems in a Series-Parallel System with Multi-State Components

In this paper, we study different methods of solving joint redundancy-availability optimization for series-parallel systems with multi-state components. We analyzed various effective factors on system availability in order to determine the optimum number and version of components in each sub-system and consider the effects of improving failure rates of each component in each sub-system and impr...

متن کامل

Reliability Modelling of the Redundancy Allocation Problem in the Series-parallel Systems and Determining the System Optimal Parameters

Considering the increasingly high attention to quality, promoting the reliability of products during designing process has gained significant importance. In this study, we consider one of the current models of the reliability science and propose a non-linear programming model for redundancy allocation in the series-parallel systems according to the redundancy strategy and considering the assump...

متن کامل

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

متن کامل

Parallelization of Hybrid Simulated Annealing and Genetic Algorithm for Short-term Production Scheduling

In short-term production planning, jobs are assigned to machines and scheduled, taking into consideration that operations must be performed in pre-defined sequences. Since the problem is NP-hard, heuristics have to be used. Simulated annealing, neural networks and genetic algorithms are some of the recent approaches. We have tried to improve those methods by taking a hybrid of simulated anneali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017